Generalized Line Graphs: Cartesian Products and Complexity of Recognition
نویسندگان
چکیده
منابع مشابه
Generalized Line Graphs: Cartesian Products and Complexity of Recognition
Putting the concept of line graph in a more general setting, for a positive integer k the k-line graph Lk(G) of a graph G has the Kk-subgraphs of G as its vertices, and two vertices of Lk(G) are adjacent if the corresponding copies of Kk in G share k− 1 vertices. Then, 2-line graph is just the line graph in usual sense, whilst 3-line graph is also known as triangle graph. The k-anti-Gallai grap...
متن کاملDomination of generalized Cartesian products
The generalized prism πG of G is the graph consisting of two copies of G, with edges between the copies determined by a permutation π acting on the vertices of G. We define a generalized Cartesian product G π H that corresponds to the Cartesian product G H when π is the identity, and the generalized prism when H is the graph K2. Burger, Mynhardt and Weakley [On the domination number of prisms o...
متن کاملGeneralized Cartesian Product of Graphs
Abstract—In graph theory, different types of products of two graphs had been studied, e.g., Cartesian product, Tensor product, Strong product, etc. In this paper we generalize the concept of Cartesian product of graphs.We define 2 Cartesian product and more generally r Cartesian product of two graphs. We study these product mainly for path graphs. We also discuss connectedness of the new graph.
متن کاملGeneralized Shifts on Cartesian Products
It is proved that if E, F are infinite dimensional strictly convex Banach spaces totally incomparable in a restricted sense, then the Cartesian product E × F with the sum or sup norm does not admit a forward shift. As a corollary it is deduced that there are no backward or forward shifts on the Cartesian product `p1 × `p2 , 1 < p1 6= p2 < ∞, with the supremum norm thus settling a problem left o...
متن کاملPolytopality and Cartesian products of graphs
We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we present three families of graphs which satisfy all these conditions, but which nonetheless are not graphs of polytopes. Our main contribution concerns the polytopality of Cartesian products of non-polytopal graphs. On ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2015
ISSN: 1077-8926
DOI: 10.37236/3983